A location-aware peer-to-peer overlay network

نویسندگان

  • Chi-Jen Wu
  • De-Kai Liu
  • Ren-Hung Hwang
چکیده

This work describes a novel location-aware, self-organizing, fault-tolerant peer-to-peer (P2P) overlay network, referred to as Laptop. Network locality-aware considerations are a very important metric for designing a P2P overlay network. Several network proximity schemes have been proposed to enhance the routing efficiency of existing DHT-based overlay networks. However, these schemes have some drawbacks such as high overlay network and routing table maintenance overhead, or not being completely selforganizing. As a result, they may result in poor scalability as the number of nodes in the system grows. Laptop constructs a location-aware overlay network without pre-determined landmarks and adopts a routing cache scheme to avoid maintaining the routing table periodically. In addition, Laptop significantly reduces the overlay maintenance overhead by making each node maintain only the connectivity between parent and itself. Mathematical analysis and simulations are conducted to evaluate the efficiency, scalability, and robustness of Laptop. Our mathematical analysis shows that the routing path length is bounded by logd N; and the joining and leaving overhead is bounded by d logd N; where N is the number of nodes in the system, and d is the maximum degree of each node on the overlay tree. Our simulation results show that the average latency stretch is 1.6 and the average routing path length is only about three in 10 000 Laptop nodes, and the maximum degree of a node is bounded by 32. Copyright # 2006 John Wiley & Sons, Ltd.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

TAC: A Topology-Aware Chord-based Peer-to-Peer Network

Among structured Peer-to-Peer systems, Chord has a general popularity due to its salient features like simplicity, high scalability, small path length with respect to network size, and flexibility on node join and departure. However, Chord doesn’t take into account the topology of underlying physical network when a new node is being added to the system, thus resulting in high routing late...

متن کامل

Overlay Topology Matching in P2P Systems

The emerging peer-to-peer (P2P) model has gained significant attention due to its many unique features in supporting file sharing among a huge number of networked users. However, the mechanism of peers randomly choosing logical neighbors without any knowledge about underlying physical topology can cause a serious topology mismatching between the P2P overlay network and the physical underlying n...

متن کامل

A Lightweight Approach to Network Positioning

This paper describes a peer-to-peer overlay network for performing location-aware node and path selection in largescale distributed systems. Our system, Meridian, provides a simple, lightweight and scalable framework for keeping track of locationinformation for participating nodes. The framework is based on local, relative coordinate systems in multi-resolution rings, direct measurement with sc...

متن کامل

Dynamic Zone-Balancing of Topology-Aware Peer-to-Peer Networks

Building a topology-aware peer-to-peer overlay network can bring many advantages, such as providing locality-aware connectivity and reducing routing path length. While its benefits on performance have been recognized, an uneven overlay zone distribution has emerged. Recent work has shown that topology-aware neighbor selection during construction can aggravate the unbalance of zone distribution ...

متن کامل

Apocrypha: Making P2P Overlays Network-aware

Many distributed systems built on peer-to-peer principles organize nodes in an overlay network, in order to enable communication between nodes. In general, this overlay network may have nothing to do with the location of nodes on the physical network. We propose a generic mechanism called Apocrypha to make any P2P overlay “network-aware”, and thus optimize internode communication. We show how A...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Int. J. Communication Systems

دوره 20  شماره 

صفحات  -

تاریخ انتشار 2007